Polynomial global product structure

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On global (strong) defensive alliances in some product graphs

A defensive alliance in a graph is a set $S$ of vertices with the property that every vertex in $S$ has at most one moreneighbor outside of $S$ than it has inside of $S$. A defensive alliance $S$ is called global if it forms a dominating set. The global defensive alliance number of a graph $G$ is the minimum cardinality of a global defensive alliance in $G$. In this article we study the global ...

متن کامل

Global Stereo in Polynomial Time

Stereo vision is one of the most thoroughly studied problems in computer vision. In a survey of the state of the art [23], and more recently on the accompanying Middlebury stereo vision web page, Scharstein and Szeliski categorize and compare a wide array of algorithms that follow approaches ranging from window-level correlation to dynamic programming, to combinatorial optimization, to belief p...

متن کامل

Product Invariant Piecewise Polynomial Approximations of Signals

The Strang and Fix conditions relate the accuracy of a finite element method to its ability to reproduce polynomials. A similar condition is proved to exist for the approximation of the product on these finite elements. Piecewise polynomial approximations are studied further, including a constructive description of all related approximate product operators.

متن کامل

Product-type Non-commutative Polynomial States

In [Ans08a, Ans08b], we investigated monic multivariate non-commutative orthogonal polynomials, their recursions, states of orthogonality, and corresponding continued fraction expansions. In this note, we collect a number of examples, demonstrating what these general results look like for the most important states on non-commutative polynomials, namely for various product states. In particular,...

متن کامل

An Elementary Product Identity in Polynomial Dynamics

Assuming that this is false, one can choose a subsequence, denoted by u j again, such that ‖u j‖ > j . Let z j := u j/‖u j‖. Then ‖z j‖ = 1, z j is orthogonal to N (I + T ), and z j + T z j = f j/‖u j‖ → 0. As before, it follows that z j → z in H , and passing to the limit in the equation for z j one gets z + T z = 0. Since z is orthogonal to N (I + T ), it follows that z = 0. This is a contrad...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the American Mathematical Society

سال: 2014

ISSN: 0002-9939,1088-6826

DOI: 10.1090/s0002-9939-2014-12255-6